منابع مشابه
Note on Counting Eulerian Circuits
We show that the problem of counting the number of Eulerian circuits in an undirected graph is complete for the class #P.
متن کاملPacking Odd Circuits in Eulerian Graphs
Let C be the clutter of odd circuits of a signed graph ðG;SÞ: For nonnegative integral edge-weights w; we are interested in the linear program minðwtx: xðCÞ51; for C 2 C; and x50Þ; which we denote by (P). The problem of solving the related integer program clearly contains the maximum cut problem, which is NP-hard. Guenin proved that (P) has an optimal solution that is integral so long as ðG;SÞ ...
متن کاملSpice Compatible Model for Multiple Coupled Nonuniform Transmission Lines Application in Transient Analysis of VLSI Circuits
An SPICE compatible model for multiple coupled nonuniform lossless transmission lines (TL's) is presented. The method of the modeling is based on the steplines approximation of the nonuniform TLs and quasi-TEM assumptions. Using steplines approximation the system of coupled nonuniform TLs is subdivided into arbitrary large number of coupled uniform lines (steplines) with different characteristi...
متن کاملCounting Eulerian Circuits is #P-Complete
We show that the problem of counting the number of Eulerian circuits in an undirected graph is complete for the class #P. The method employed is mod-p reduction from counting Eulerian orientations.
متن کاملEulerian circuits with no monochromatic transitions
Let G be an eulerian digraph with a fixed edge coloring (not necessarily a proper edge coloring). A compatible circuit of G is an eulerian circuit such that every two consecutive edges in the circuit have different colors. We characterize the existence of compatible circuits for directed graphs avoiding certain vertices of outdegree three. Our result is analogous to a result of Kotzig for compa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1995
ISSN: 0166-218X
DOI: 10.1016/0166-218x(94)00083-p